Higher dimensional restricted lattice paths with diagonal steps
نویسندگان
چکیده
Kaparthi, S. and H.R. Rao, Higher dimensional restricted lattice paths with diagonal steps, Discrete Applied Mathematics 31(1991) 279-289. In this paper, restricted minimal lattice paths with horizontal, vertical, and diagonal steps, in two and higher dimensions are discussed. The Delannoy numbers, the numbers of unrestricted minimal lattice paths with diagonal steps, and some of their properties are introduced. The recurrence on the Delannoy numbers is extended to higher dimensions. The relation in two dimensions between the restricted minimal lattice paths and the Delannoy numbers is shown through the use of Andre’s reflection principle. This relation is generalized from two dimensions to higher dimensions and is found to be in the form of a determinant. The relation between unrestricted and restricted weighted minimal lattice paths in two dimensions is shown by the extension of Andre’s reflection principle.
منابع مشابه
The 2 n − 1 factor for multi - dimensional lattice paths with diagonal steps
In Zd, let D(n) denote the set of lattice paths from the origin to (n, n, . . . , n) that use nonzero steps of the form (x1, x2, . . . , xd) where xi ∈ {0, 1} for 1 ≤ i ≤ d. Let S(n) denote the set of lattice paths from the origin to (n, n, . . . , n) that use nonzero steps of the form (x1, x2, . . . , xd) where xi ≥ 0 for 1 ≤ i ≤ d. For d = 3, we prove bijectively that the cardinalities satisf...
متن کاملGeneralizing Narayana and Schröder Numbers to Higher Dimensions
Let C(d, n) denote the set of d-dimensional lattice paths using the steps X1 := (1, 0, . . . , 0), X2 := (0, 1, . . . , 0), . . . , Xd := (0, 0, . . . , 1), running from (0, 0, . . . , 0) to (n, n, . . . , n), and lying in {(x1, x2, . . . , xd) : 0 ≤ x1 ≤ x2 ≤ . . . ≤ xd}. On any path P := p1p2 . . . pdn ∈ C(d, n), define the statistics asc(P ) :=|{i : pipi+1 = XjX`, j < `}| and des(P ) :=|{i :...
متن کاملBijective Recurrences concerning Schro"der Paths
Consider lattice paths in Z2 with three step types: the up diagonal (1, 1), the down diagonal (1,−1), and the double horizontal (2, 0). For n ≥ 1, let Sn denote the set of such paths running from (0, 0) to (2n, 0) and remaining strictly above the x-axis except initially and terminally. It is well known that the cardinalities, rn = |Sn|, are the large Schröder numbers. We use lattice paths to in...
متن کاملBijective Recurrences concerning Schrr Oder Paths
Consider lattice paths in Z 2 with three step types: the up diagonal (1; 1), the down diagonal (1; ?1), and the double horizontal (2; 0). For n 1, let S n denote the set of such paths running from (0; 0) to (2n; 0) and remaining strictly above the x-axis except initially and terminally. It is well known that the cardinalities, r n = jS n j, are the large Schrr oder numbers. We use lattice paths...
متن کاملLattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m,n] = w0(d[m− 1, n]+d[m,n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m− sk, n− rk]) where ω0, . . . ωk are weights, r1, . . . rk and s1, . . . sk are positive integers. We prove three theorems about solving symmetric backwards recursions restricted to the diagonal band x+ u < y < x− l. With a solution we mean a formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 31 شماره
صفحات -
تاریخ انتشار 1991